Sweeping process with regular and nonregular sets
نویسندگان
چکیده
منابع مشابه
Sweeping process by prox-regular sets in Riemannian Hilbert manifolds
— In this paper, we deal with sweeping processes on (possibly infinitedimensional) Riemannian Hilbert manifolds. We extend the useful notions (proximal normal cone, prox-regularity) already defined in the setting of a Hilbert space to the framework of such manifolds. Especially we introduce the concept of local prox-regularity of a closed subset in accordance with the geometrical features of th...
متن کاملSymbolic Reachability Analysis of FIFO - ChannelSystems with Nonregular Sets
We address the veriication problem of FIFO-channel systems by applying the symbolic analysis principle. We represent their sets of states (conngurations) using structures called CQDD's combining nite-state automata with linear constraints on number of occurrences of symbols. We show that CQDD's allow forward and backward reachability analysis of systems with nonregular sets of conngurations. Mo...
متن کاملInexpressibility Results for Regular Languages in Nonregular Settings
My ostensible purpose in this talk is to describe some new results (found in collaboration with Amitabha Roy) on expressibility of regular languages in certain generalizations of first-order logic. [10]. This provides me with a good excuse for describing some the work on the algebraic theory of regular languages in what one might call “nonregular settings”. The syntactic monoid and syntactic mo...
متن کاملSweeping by a tame process
We show that any semi-algebraic sweeping process admits piecewise absolutely continuous solutions, and any such bounded trajectory must have finite length. Analogous results hold more generally for sweeping processes definable in o-minimal structures. This extends previous work on (sub)gradient dynamical systems beyond monotone sweeping sets.
متن کاملRegular Sets of Pomsets with Autoconcurrency
Partially ordered multisets (or pomsets) constitute one of the most basic models of concurrency. We introduce and compare several notions of regularity for pomset languages by means of contexts and residues of different kinds. We establish some interesting closure properties that allow us to relate this approach to SP-recognizability in the particular case of series-parallel pomsets. Finally we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Differential Equations
سال: 2003
ISSN: 0022-0396
DOI: 10.1016/s0022-0396(03)00129-3